Classroom Assignment using Constraint Logic Programming
نویسندگان
چکیده
The Classroom Assignment problem consists of scheduling a set of courses into a fixed number of rooms, given a fixed timetable. At the University of Munich, a classroom plan has to be created each semester after collecting timetables of all departments and wishes of teachers. This planning is very complex since a lot of constraints have to be met, e.g. room size and equipment. Using constraint-based programming, we developed a prototype, called RoomPlan, that supports automatic creation of classroom plans. With RoomPlan a schedule can be created interactively within some minutes instead of some days. RoomPlan was presented at the Systems’99 Computer exhibition in Munich.
منابع مشابه
A Constraint-Based Assignment System for Automating Long Side Chain Assignments in Protein 2D NMR Spectra
The sequential assignment of protein 2D NMR data has been tackled by many automated and semi-automated systems. One area that these systems have not tackled is the searching of the TOCSY spectrum looking for cross peaks and chemical shift values for hydrogen nuclei that are at the end of long side chains. This paper describes our system for solving this problem using constraint logic programmin...
متن کاملCrew Assignment by Constraint Logic Programming
In this paper, we deal with the crew assignment problem, which is a subproblem of the airline crew scheduling problem. The aim of the crew assignment problem is the optimal allocation of a given set of crew pairings to crew members, in a way that a set of constraints is satis ed. The optimality criterion we employ in this work requires the ight time fair distribution among all crew members. Thi...
متن کاملICLP 2005 Doctoral Consortium SiLCC Is Linear Concurrent Constraint Programming
Introduction. The Concurrent Constraint (CC) [8] languages allow to model a large number of constraint programming systems, form Prolog coroutinings to constraints propagation mechanisms such these implemented in the Finite Domain (FD) solver of GNU-Prolog [2]. These languages are an extension of CLP obtained by an addition of a synchronization primitive based on constraint implication. The Lin...
متن کاملAn ASP Semantics for Default Reasoning with Constraints
We introduce the logic of Here-and-There with Constraints in order to capture constraint theories in the non-monotonic setting known from Answer Set Programming (ASP). This allows for assigning default values to constraint variables or to leave them undefined. Also, it provides us with a semantic framework integrating ASP and Constraint Processing in a uniform way. We put some emphasis on logic...
متن کاملA Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. Tasks assigned to a facility may run in parallel subject to resource constraints (cumulative scheduling). We solve minimum cost problems, as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000